Tensor Robust Principal Component Analysis with a New Tensor Nuclear Norm
نویسندگان
چکیده
منابع مشابه
Principal Component Analysis with Tensor Train Subspace
Tensor train is a hierarchical tensor network structure that helps alleviate the curse of dimensionality by parameterizing large-scale multidimensional data via a set of network of low-rank tensors. Associated with such a construction is a notion of Tensor Train subspace and in this paper we propose a TTPCA algorithm for estimating this structured subspace from the given data. By maintaining lo...
متن کاملTensor principal component analysis via convex optimization
This paper is concerned with the computation of the principal components for a general tensor, known as the tensor principal component analysis (PCA) problem. We show that the general tensor PCA problem is reducible to its special case where the tensor in question is supersymmetric with an even degree. In that case, the tensor can be embedded into a symmetric matrix. We prove that if the tensor...
متن کاملRobust Principal Component Analysis with Non-Greedy l1-Norm Maximization
Principal Component Analysis (PCA) is one of the most important methods to handle highdimensional data. However, the high computational complexitymakes it hard to apply to the large scale data with high dimensionality, and the used 2-norm makes it sensitive to outliers. A recent work proposed principal component analysis based on 1-normmaximization, which is efficient and robust to outliers. In...
متن کاملRobust tensor factorization using R1 norm
Over the years, many tensor based algorithms, e.g. two dimensional principle component analysis (2DPCA), two dimensional singular value decomposition (2DSVD), high order SVD, have been proposed for the study of high dimensional data in a large variety of computer vision applications. An intrinsic limitation of previous tensor reduction methods is the sensitivity to the presence of outliers, bec...
متن کاملComputational Complexity of Tensor Nuclear Norm
The main result of this paper is that the weak membership problem in the unit ball of a given norm is NP-hard if and only if the weak membership problem in the unit ball of the dual norm is NP-hard. Equivalently, the approximation of a given norm is polynomial time if and only if the approximation of the dual norm is polynomial time. Using the NP-hardness of the approximation of spectral norm o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2020
ISSN: 0162-8828,2160-9292,1939-3539
DOI: 10.1109/tpami.2019.2891760